Function integration, reconstruction and approximation using rank-$1$ lattices
نویسندگان
چکیده
We consider rank-$1$ lattices for integration and reconstruction of functions with series expansion supported on a finite index set. explore the connection between periodic Fourier space non-periodic cosine Chebyshev space, via tent transform then transform, to transfer known results from setting into new insights settings. Fast discrete can be applied phase. To reduce size auxiliary set in associated component-by-component (CBC) construction lattice generating vectors, we work bi-orthonormal basis functions, leading three methods function provide theory efficient algorithmic strategies CBC construction. also interpret our context general approximation least-squares approximation.
منابع مشابه
Lattice based integration algorithms: Kronecker sequences and rank-1 lattices
We prove upper bounds on the order of convergence of lattice based algorithms for numerical integration in function spaces of dominating mixed smoothness on the unit cube with homogeneous boundary condition. More precisely, we study worst-case integration errors for Besov spaces of dominating mixed smoothness B̊p,θ, which also comprise the concept of Sobolev spaces of dominating mixed smoothness...
متن کاملseismic velocity analysis using low-rank approximation of the kernel function and a butterfly algorithm
velocity analysis is one of the most important step in seismic data processing. it affects not only many processing steps directly and indirectly, but also is known as a primary interpretation of the data. however, it can also be assumed as one of the most time consuming processing step. the conventional velocity analysis method measures the energy amplitude along hyperbolic trajectories within...
متن کاملTextures on Rank-1 Lattices
Storing textures on orthogonal tensor product lattices is predominant in computer graphics, although it is known that their sampling efficiency is not optimal. In two dimensions, the hexagonal lattice provides the maximum sampling efficiency. However, handling these lattices is difficult, because they are not able to tile an arbitrary rectangular region and have an irrational basis. By storing ...
متن کاملSimulation on Rank-1 Lattices
Rank-1 lattices are available in any dimension for any number of lattice points and because their generation is so efficient, they often are used in quasi-Monte Carlo methods. Applying the Fourier transform to functions sampled on rank-1 lattice points turns out to be simple and efficient if the number of lattice points is a power of two. Considering the Voronoi diagram of a rank-1 lattice as a...
متن کاملValue function approximation via low-rank models
We propose a novel value function approximation technique for Markov decision processes. We consider the problem of compactly representing the state-action value function using a low-rank and sparse matrix model. The problem is to decompose a matrix that encodes the true value function into low-rank and sparse components, and we achieve this using Robust Principal Component Analysis (PCA). Unde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2021
ISSN: ['1088-6842', '0025-5718']
DOI: https://doi.org/10.1090/mcom/3595